Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries

In this paper, an integrated due date assignment, and delivery scheduling of order for multi customer for make to order production system in supply chain has been survered. One manufacture received n orders from K customers. The due date of orders for each customer is common and manufacture can assign the due dates with a related cost. Orders must be process by one machine and send to customers by vehicles sending several jobs with one vehicle lead to less transportation cost but may increase the number of tardy jobs. The objective is determining the due dates and production and delivery scheduling so that the related costs is minimized. We present an MINLP model for this problem and a heuristic algorithm for solving it. Computational test is performed for evaluation of these two methods. The obtained results show that the heuristic algorithm is efficient.